On the Interpolation Step in the Guruswami-Sudan List Decoding Algorithm for Reed-Solomon Codes
نویسنده
چکیده
Divide-and-conquer method for interpolation in Guruswami-Sudan (GS) list decoding algorithm is considered. It is shown that the Groebner basis (GB) of the ideal of bivariate interpolation polynomials (IP) can be obtained as a product of trivariate polynomials corresponding to disjoint subsets of interpolation points. The impact of monomial ordering on the interpolation complexity is studied.
منابع مشابه
Interpolation in list decoding of Reed-Solomon codes
The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is pro...
متن کاملReduced List-Decoding of Reed-Solomon Codes Using Reliability Information
We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word. We refer to this decoding method as reduced list-decoding, since not all received ...
متن کاملThe Guruswami–Sudan Decoding Algorithm for Reed–Solomon Codes
This article is a tutorial discussion of the Guruswami–Sudan (GS) Reed–Solomon decoding algorithm, including self-contained treatments of the Kötter and Roth– Ruckenstein (RR) improvements. It also contains a number of new results, including a rigorous discussion of the average size of the decoder’s list, an improvement in the RR algorithm’s stopping rule, a simplified treatment of the combinat...
متن کاملAlgebraic Soft-Decision Decoding of Reed–Solomon Codes
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along w...
متن کاملPerformance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency
List decoding is a novel method for decoding Reed–Solomon (RS) codes that generates a list of candidate transmitted messages instead of one unique message as with conventional algebraic decoding, making it possible to correct more errors. The Guruswami–Sudan (GS) algorithm is the most efficient list decoding algorithm for RS codes. Until recently only a few papers in the literature suggested pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006